On one iteration method for cyclic matrices
نویسندگان
چکیده
منابع مشابه
The QR iteration method for quasiseparable matrices
Let {ak}, k = 1, . . . , N be a family of matrices of sizes rk × rk−1. For positive integers i, j, i > j define the operation aij as follows: a × ij = ai−1 · · ·aj+1 for i > j + 1, aj+1,j = Irj . Let {bk}, k = 1, . . . , N be a family of matrices of sizes rk−1 × rk. For positive integers i, j, j > i define the operation bij as follows: b × ij = bi+1 · · · bj−1 for j > i+ 1, bi,i+1 = Iri . It is...
متن کاملOptimal Convergence of the Simultaneous Iteration Method for Normal Matrices
Simultaneous iteration methods are extensions of the power method that were devised for approximating several dominant eigenvalues of a matrix and the corresponding eigenvectors. The convergence analysis of these methods has been given for both hermitian and nonhermitian matrices. In this paper we concentrate on normal matrices which include also the hermitian matrices, and provide a rigorous a...
متن کاملInverse Iteration on Defective Matrices
Very often, inverse iteration is used with shifts to accelerate convergence to an eigenvector. In this paper, it is shown that, if the eigenvalue belongs to a nonlinear elementary divisor, the vector sequences may diverge even when the shift sequences converge to the eigenvalue. The local behavior is discussed through a 2 X 2 example, and a sufficient condition for the convergence of the vector...
متن کاملAn Algebraic Multilevel Iteration Method for Finite Element Matrices∗
To solve a sparse linear system of equations resulting from the finite element approximation of elliptic self-adjoint second order boundary value problems an algebraic multilevel iteration method is presented. The new method can be considered as an extension of methods, which have been defined by Axelsson and Eijkhout [4] for nine-point matrices and later generalized by Axelsson and Neytcheva [...
متن کاملConvergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing and comparing various methods designed to this purpose. According to Dayar T., Stewart W.J. Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains. SIAM J. Sci. Comput.Vo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1972
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1972.103411